Biological Sequence Analysis Using Regular Expressions
نویسندگان
چکیده
منابع مشابه
Biological sequence analysis using regular expressions.
“Regular expressions”, also known as “RegExps” or sometimes as “grep patterns”, are a way of specifying patterns of characters within a text file or longer string of characters. Regular expressions can contain various “wild cards” or sets of alternatives, which can be used to include ambiguity in the pattern to be matched. One common use is to perform sophisticated find-and-replace operations.
متن کاملCategorizing Event Sequences Using Regular Expressions
IASSIST Quarterly Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its po...
متن کاملStream Processing using Grammars and Regular Expressions
In this dissertation we study expression based parsing and the use of grammatical specifications for the synthesis of fast, streaming stringprocessing programs. In the first part we develop two linear-time algorithms for regular expression based parsing with Perl-style greedy disambiguation. The first algorithm operates in two passes in a semi-streaming fashion, using a constant amount of worki...
متن کاملCategorizing Event Sequences Using Regular Expressions
Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its potential applicatio...
متن کاملOptimizing Regular Path Expressions Using Graph Schemas
Several languages, such as LOREL and UnQL, support querying of semi-structured data. Others, such as WebSQL and WebLog, query Web sites. All these languages model data as labeled graphs and use regular path expressions to express queries that traverse arbitrary paths in graphs. Naive execution of path expressions is ineecient, however, because it often requires exhaustive graph search. We descr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioTechniques
سال: 1999
ISSN: 0736-6205,1940-9818
DOI: 10.2144/99271ir01